[20260124] BOJ / G4 / 북쪽나라의 도로 / 이인희 #1828
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/1595
🧭 풀이 시간
55 분
👀 체감 난이도
✏️ 문제 설명
🔍 풀이 방법
트리의 지름: 1. 어느 한 점에서 bfs로 최장거리 가지는 노드 번호p 구하기 / 2. p에서 똑같이 bfs로 최장거리 구하기 그것이 트리의 지름⏳ 회고
putIfAbsent()사용 습관화하기모든 두 정점간의 경로가 유일한 그래프 === 트리임을 기억하기